Static slicing of explicitly synchronized languages

Static analysis of concurrent languages is a complex task due to the non-deterministicexecution of processes. If the concurrent language being studied allows process synchro-nization, then the analyses are even more complex (and thus expensive), e.g., due to thephenomenon of deadlock. In this work we introduce a static analysis technique based onprogram slicing for concurrent and explicitly synchronized languages in general, and CSPin particular. Concretely, given a particular point in a specification, our technique allowsus to know what parts of the specification must necessarily be executed before this point,and what parts of the specification could be executed before it. Our technique is basedon a new data structure that extends the Synchronized Control Flow Graph (SCFG).We show that this new data structure improves the SCFG by taking into account thecontext in which processes are called and, thus, it makes the slicing process more precise.The technique has been implemented and tested with real specifications, producing goodresults. After formally defining our technique, we describe our tool, its architecture, itsmain applications and the results obtained from several experiments conducted in orderto measure the performance of the tool.